Ranking functions and rankings on languages
نویسنده
چکیده
The Spohnian paradigm of ranking functions is in many respects like an order-of-magnitude reverse of subjective probability theory. Unlike probabilities, however, ranking functions are only indirectly—via a pointwise ranking function on the underlying set of possibilities W—defined on a field of propositions A over W . This research note shows under which conditions ranking functions on a field of propositions A over W and rankings on a language L are induced by pointwise ranking functions on W and the set of models for L, ModL, respectively. 2005 Elsevier B.V. All rights reserved.
منابع مشابه
Evaluation and Ranking of Discrete Simulation Tools
In studying through simulation, choosing an appropriate tool/language would be a difficult task because many of them are available. On the other hand, few research works focus on evaluation of simulation tools/languages and their comparison. This paper makes a couple of evaluations and ranks more than fifty simulation tools that are currently available. The first evaluation and ranking is in th...
متن کاملRanking Stock Exchange Companies With a Combined Approach Based on FAHP-FTOPSIS Financial Ratios and Comparing Them With Tehran Stock Exchange Rankings
Ranking of companies listed on the exchange represent their status and considered a criterion for investment. Also, it increases market's competition, development and efficiency. In this study, the fifty superior companies listed in Tehran Stock Exchange were ranked based on financial ratios (liquidity, operational, leverage and profitability) using FAHP- FTOPSIS hybrid approach during the year...
متن کاملEffective Learning to Rank Persian Web Content
Persian language is one of the most widely used languages in the Web environment. Hence, the Persian Web includes invaluable information that is required to be retrieved effectively. Similar to other languages, ranking algorithms for the Persian Web content, deal with different challenges, such as applicability issues in real-world situations as well as the lack of user modeling. CF-Rank, as a ...
متن کاملRanking Aggregation Based on Belief Function Theory
The ranking aggregation problem is that to establishing a new aggregate ranking given a set of rankings of a finite set of items. This problem is met in various applications, such as the combination of user preferences, the combination of lists of documents retrieved by search engines and the combination of ranked gene lists. In the literature, the ranking aggregation problem has been solved as...
متن کاملSyllable types in cross-linguistic and developmental grammars
In Optimality Theory (Prince & Smolensky 1993) both language acquisition and language typology can be accommodated. The basic assumption is that constraints are universal, but that the rankings of these constraints are language particular. For language typology the idea is that different rankings reflect different (possible) languages. For acquisition the idea is that the learner needs to acqui...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Artif. Intell.
دوره 170 شماره
صفحات -
تاریخ انتشار 2006